Bigram and Unigram Based Text Attack via Adaptive Monotonic Heuristic Search
نویسندگان
چکیده
Deep neural networks (DNNs) are known to be vulnerable adversarial images, while their robustness in text classification rarely studied. Several lines of attack methods have been proposed the literature, such as character-level, word-level, and sentence-level attacks. However, it is still a challenge minimize number word distortions necessary induce misclassification, simultaneously ensuring lexical correctness, syntactic semantic similarity. In this paper, we propose Bigram Unigram based Monotonic Heuristic Search (BU-MHS) method examine vulnerability deep models. Our has three major merits. Firstly, documents not only at unigram level but also bigram avoid producing meaningless outputs. Secondly, hybrid replace input words with both synonyms sememe candidates, which greatly enriches potential substitutions compared using synonyms. Lastly, design search algorithm, i.e., (MHS), determine priority replacements, aiming reduce modification cost an attack. We evaluate effectiveness BU-MHS on IMDB, AG's News, Yahoo! Answers datasets by attacking four state-of-the-art DNNs Experimental results show that our achieves highest success rate changing smallest other existing
منابع مشابه
A Comparing between the impacts of text based indexing and folksonomy on ranking of images search via Google search engine
Background and Aim: The purpose of this study was to compare the impact of text based indexing and folksonomy in image retrieval via Google search engine. Methods: This study used experimental method. The sample is 30 images extracted from the book “Gray anatomy”. The research was carried out in 4 stages; in the first stage, images were uploaded to an “Instagram” account so the images are tagge...
متن کاملUntangled Monotonic Chains and Adaptive Range Search
We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search performance for data with more inherent sortedness. Given n points in the plane, it can answer range queries in O(k logn+m) time, where m is the number of points in the output and k is the minimum number of monotonic chains into whic...
متن کاملRearrangement Planning via Heuristic Search
—We present a method to apply heuristic search algorithms to solve rearrangement planning by pushing problems. In these problems, a robot must push an object through clutter to achieve a goal. To do this, we exploit the fact that contact with objects in the environment is critical to goal achievement. We dynamically generate goal-directed primitives that create and maintain contact between robo...
متن کاملLearning Heuristic Search via Imitation
Robotic motion planning problems are typically solved by constructing a search tree of valid maneuvers from a start to a goal configuration. Limited onboard computation and real-time planning constraints impose a limit on how large this search tree can grow. Heuristics play a crucial role in such situations by guiding the search towards potentially good directions and consequently minimizing se...
متن کاملUsing Unigram and Bigram Language Models for Monolingual and Cross-Language IR
Due to the lack of explicit word boundaries in Chinese, and Japanese, and to some extent in Korean, an additional problem in IR in these languages is to determine the appropriate indexing units. For CLIR with these languages, we also need to determine translation units. Both words and ngrams of characters have been used in IR in these languages; however, only words have been used as translation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i1.16151